Decomposition of a 2D polygon into a minimal set of disjoint primitives
نویسندگان
چکیده
This paper presents a method based on artificial intelligence (AI) techniques for decomposing a two-dimensional polygon into a minimal set of disjoint primitives. Decomposition is accomplished using a search algorithm based on recursively splitting the given shape into smaller parts until a primitive is recognized. The method operates in a primitive-oriented environment, where each primitive type must provide three basic member functions, namely (a) a function for recognizing a shape as the primitive, (b) a function for suggesting new splitting curves for a given shape, and (c) a function for optimistically estimating the number of primitives required to tile a shape. Optimality in the number of decomposition units can be guaranteed subject to the domain spanned by function (b). The proposed method produces a hierarchical decomposition of the shape. Examples from a working implementation are shown.
منابع مشابه
Partitioning a Polygon into Two Mirror Congruent Pieces
Polygon decomposition problems are well studied in the literature [6], yet many variants of these problems remain open. In this paper, we are interested in partitioning a polygon into mirror congruent pieces. Symmetry detection algorithms solve problems of the same flavor by detecting all kinds of isometries in a polygon, a set of points, a set of line segments and some classes of polyhedra [2]...
متن کاملMinimal Convex Decompositions
Let P be a set of n points on the plane in general position. We say that a set Γ of convex polygons with vertices in P is a convex decomposition of P if: Union of all elements in Γ is the convex hull of P, every element in Γ is empty, and for any two different elements of Γ their interiors are disjoint. A minimal convex decomposition of P is a convex decomposition Γ′ such that for any two adjac...
متن کاملGeneralisation of 3d Building Models by Cell Decomposition and Primitive Instancing
The article presents a cartographic generalisation approach for 3D building models with regard to the thematic visualisation of urban landscapes. Based on our earlier work to utilise approximating planes for generating simplified cell decompositions of the input objects, a new extension is introduced that guarantees well-formed roof structures. This is accomplished by first creating a simplifie...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل